搜索资源列表
1
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Storage without the use of the adjacent table to the map, and the depth and breadth traversal graph traversal
tudexg
- 1.邻接表创建图 2.打印图的信息 3.深度优先遍历图 4.最小生成树 5.邻接矩阵创建无向网-1. Adjacency table to create Figure 2. Print map information 3. Depth-first traversal Figure 4. Minimum Spanning Tree 5. Adjacency matrix to create a non-network
Graph
- 图中查找元素，广度优先遍历，深度优先遍历-Find a map element, breadth-first traversal, depth-first traversal
C
- 图的深度优先遍历，图的广度优先遍历，及图的存储-Map depth-first traversal, breadth-first traversal of the graph, and map storage
group
- 建立一个图结构，并对其进行深度遍历和广度遍历，输出结果-The establishment of a map structure, and its depth and breadth traversal traversal, output
COLORING
- 图用邻接矩阵表示，程序逻辑为，首先实现了用于确定一种有效颜色的函数color（），然后，按照深度优先和违反约束则回溯的策略进行搜索。-Map with the adjacency matrix that logic to, first of all to achieve the color used to determine the function of an effective color (), and then, in accordance with the depth-first an
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
ArcIMSBasedMapCutting
- 地图的瓦片分割显示原理的剖析，深入透析Google Map的客户端地图显示机理-Map shows principle of split tile analysis, in-depth client dialysis Google Map map display mechanism of
Cpp1
- 图的基本操作，用C语言编写的，有图的创建和深度搜索，自己编写的-Map basic operation, using C language, there are plans to create and depth of the search, have written
creatgraph
- 图的建立和图的广度深度优先遍历（有向图和无向图）-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)
tu3
- 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix
jsj
- 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps
Battlefield_C_2008
- This application is a battlefield simulator game with three types of units: Infantry, Cavalry, and Artillery. The map consists of several different terrain types lined in a six-sided-square grid as seen in many turn-based video games. The computer pl
main
- Descr iption: 采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字
main
- 采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻
7-2-1
- 图的基本运算，包括邻接矩阵，邻接表存储。还有图的深度优先，广度优先算法，老师写的-Map basic operations, including the adjacency matrix, adjacency list is stored. There are also a depth-first, breadth-first algorithm, the teacher wrote
graph.yangxu
- 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth trav
ShadowMap
- Opengl超级宝典阴影贴图的例子，例子利用深度缓冲区实现阴影贴图。-Opengl Super Bible examples of shadow maps, examples of using the depth buffer to achieve a shadow map.
tu
- 用C语言编程一个有向图如下，功能要求如下：输入并生成该图；深度优先遍历；广度优先遍历； -With the C programming language as a directed graph, functional requirements are as follows: input and generate the map depth-first traversal breadth-first traversal
MapCreation
- 图的创建，深度优先和广度优先搜索，有实验报告-Map creation, depth-first and breadth-first search, there are experimental reports